Binary Multidimensional Scaling
نویسندگان
چکیده
منابع مشابه
Methods for Binary Multidimensional Scaling
Multidimensional scaling (MDS) is the process of transforming a set of points in a high-dimensional space to a lower-dimensional one while preserving the relative distances between pairs of points. Although effective methods have been developed for solving a variety of MDS problems, they mainly depend on the vectors in the lower-dimensional space having real-valued components. For some applicat...
متن کاملUsing Multidimensional Scaling for Assessment Economic Development of Regions
Addressing socio-economic development issues are strategic and most important for any country. Multidimensional statistical analysis methods, including comprehensive index assessment, have been successfully used to address this challenge, but they donchr('39')t cover all aspects of development, leaving some gap in the development of multidimensional metrics. The purpose of the study is to const...
متن کاملMultidimensional Scaling of Binary Dissimilarities: Direct and Derived Approaches.
Given a matrix of dissimilarities, it has been debated whether researchers should perform multidimensional scaling on this original matrix or on a new one derived by comparing rows in the original matrix. Careful comparison studies (Drasgow & Jones, 1979; Van der Kloot & Van Herk, 1991) in the context of sorting data indicated that most of the initial enthusiasm for the derivative approach was ...
متن کاملFinite-Length Scaling for Gallager A
We consider LDPC codes, transmission over the binary symmetric channel (BSC), and decoding using Gallager’s algorithm A. For those ensembles whose threshold is determined by the behavior of the algorithm at the beginning of the decoding process we derive a scaling law. This scaling law has the same form as the scaling law which was established for the the case of transmission over the binary er...
متن کاملMultidimensional Balanced Binary Trees
A bstract-A new balanced multidimensional tree structure called a k-dimensional balanced binary tree, k a positive integer, is presented and investigated. It is shown that the data structure can be used to manage a set of n k-dimensional data items such that access, insertion, and deletion operations can be supported in Ooog n + k) time. The data structure is a multidimensional generalization o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002